Indexing in Data Warehouses: Bitmaps and Beyond
نویسندگان
چکیده
Bitmap indexes (BIs) allow fast access to individual attribute values that are needed to answer a query by storing a bit for each distinct value and tuple. A BI is defined for a single attribute and the encodings are based solely on data values; the property map (PMap) is a multidimensional indexing technique that precomputes attribute expressions for each tuple and stores the results as bit strings. In order to determine whether the PMap is competitive with BIs, we conduct a performance study of the PMap with the range encoded bit sliced index (REBSI) using cost models to simulate storage and query processing costs for different kinds of query types. We identify parameters that have significant effect on index performance and determine situations in which either index is more suitable. These results could be useful for improving the performance of an analytical decision making system. IntroductIon
منابع مشابه
Bulkloading of Bitmap Indices
The conventional indexing technique designed for the traditional database systems does not use the read-only characteristics of the data warehouse environment. Recently, Bitmap Indexing has been proposed as a candidate indexing structure suitable for the read-only environments, like those of decision support systems. The current paper presents a short literature survey of the various clone of t...
متن کاملFuzzy Song Sets for Music Warehouses
The emergence of music recommendation systems calls for the development of new data management technologies able to query vast music collections. In this paper, we define fuzzy song sets and an algebra to manipulate them. We present a music warehouse prototype able to perform efficient nearest neighbor searches in an arbitrary song similarity space. Using fuzzy song sets, the music warehouse of...
متن کاملEncoded Bitmap Indexing for Data Warehouses
Complex query types huge data volumes and very high read update ratios make the indexing techniques designed and tuned for traditional database systems unsuitable for data warehouses DW We propose an encoded bitmap indexing for DWs which improves the performance of known bitmap indexing in the case of large cardinality domains A performance analysis and theorems which identify properties of goo...
متن کاملIndexing Incomplete Databases
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We first show that known indexing techniques for multi-dimensional data search break down in terms of performance when indexed attributes contain missing data. This paper utilizes two popularly employed indexing techniq...
متن کاملVirtual indexing based methods for estimating node connection degrees
It is difficult to accurately measure node connection degrees for a high speed network, since there is a massive amount of traffic to be processed. In this paper, we present a new virtual indexing method for estimating node connection degrees for high speed links. It is based on the virtual connection degree sketch (VCDS) where a compact sketch of network traffic is built by generating multiple...
متن کامل